Neural Bit Embeddings for Graphs

ABSTRACT

An approach is provided in which a system transforms a set of embedding approximation values corresponding to a set of knowledge graph nodes into a set of binary valued embedding vectors. The system evaluates the set of binary valued embedding vectors against a query and a selects one of the binary valued embedding vectors based on the evaluation. The system then identifies one of the knowledge graph nodes that corresponds to the selected binary valued embedding vector and in turn, provides a result to the query based on the identified knowledge graph node.

BACKGROUND

Knowledge Graphs are emerging as a popular and useful way to representand leverage codified information for a variety of use cases. Knowledgegraphs may be used in cognitive computing to build large knowledge basesof structured collections of facts about the world that computer systemsuse to reason and to interact with humans more naturally. For example,codifying key concepts and relationships of a particular domain maygreatly accelerate a variety of tasks from providing semantic andnatural language search over more traditional business intelligencedata, to providing enabling query expansion and matching, to discoveryand exploration of related concepts and relations extracted from a largecorpus of unstructured documents.

Knowledge graphs include nodes (entities) and edges that connect thenodes. For larger knowledge graphs, or for knowledge graphs with noisyedges, algorithmically aiding a user in accurate information retrievalis necessary to process a query, such as by identifying the mostimportant edges, predicting links that do not exist, etc. While accuracyis important, the responsiveness of the information retrieval iscritical to support real-time time data analysis.

BRIEF SUMMARY

According to one embodiment of the present disclosure, an approach isprovided in which a system transforms a set of embedding approximationvalues corresponding to a set of knowledge graph nodes into a set ofbinary valued embedding vectors. The system evaluates the set of binaryvalued embedding vectors against a query and a selects one of the binaryvalued embedding vectors based on the evaluation. The system thenidentifies one of the knowledge graph nodes that corresponds to theselected binary valued embedding vector and in turn, provides a resultto the query based on the identified knowledge graph node.

The foregoing is a summary and thus contains, by necessity,simplifications, generalizations, and omissions of detail; consequently,those skilled in the art will appreciate that the summary isillustrative only and is not intended to be in any way limiting. Otheraspects, inventive features, and advantages of the present disclosure,as defined solely by the claims, will become apparent in thenon-limiting detailed description set forth below.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The present disclosure may be better understood, and its numerousobjects, features, and advantages made apparent to those skilled in theart by referencing the accompanying drawings, wherein:

FIG. 1 is a block diagram of a data processing system in which themethods described herein can be implemented;

FIG. 2 provides an extension of the information handling systemenvironment shown in FIG. 1 to illustrate that the methods describedherein can be performed on a wide variety of information handlingsystems which operate in a networked environment;

FIG. 3 is a high-level diagram depicting an example of a systemtransforming knowledge graph information into binary-valued embeddingvectors and using the binary-valued embedding vectors to efficientlyprovide information during a question answer session;

FIG. 4 is a flowchart depicting an example of steps taken to generatebinary value embedding vectors for nodes in a knowledge graph;

FIG. 5 is a diagram depicting an example of a knowledge graph andbinary-valued embedding vectors generated through steps discussedherein; and

FIG. 6 is a flowchart depicting an example of steps taken to receive aquery and efficiently provide accurate information using pre-generatedbinary-valued embedding vectors.

DETAILED DESCRIPTION

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the disclosure.As used herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of oneor more other features, integers, steps, operations, elements,components, and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present disclosure has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the disclosure in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the disclosure. Theembodiment was chosen and described in order to best explain theprinciples of the disclosure and the practical application, and toenable others of ordinary skill in the art to understand the disclosurefor various embodiments with various modifications as are suited to theparticular use contemplated.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions. The following detailed description willgenerally follow the summary of the disclosure, as set forth above,further explaining and expanding the definitions of the various aspectsand embodiments of the disclosure as necessary.

FIG. 1 illustrates information handling system 100, which is asimplified example of a computer system capable of performing thecomputing operations described herein. Information handling system 100includes one or more processors 110 coupled to processor interface bus112. Processor interface bus 112 connects processors 110 to Northbridge115, which is also known as the Memory Controller Hub (MCH). Northbridge115 connects to system memory 120 and provides a means for processor(s)110 to access the system memory. Graphics controller 125 also connectsto Northbridge 115. In one embodiment, Peripheral Component Interconnect(PCI) Express bus 118 connects Northbridge 115 to graphics controller125. Graphics controller 125 connects to display device 130, such as acomputer monitor.

Northbridge 115 and Southbridge 135 connect to each other using bus 119.In one embodiment, the bus is a Direct Media Interface (DMI) bus thattransfers data at high speeds in each direction between Northbridge 115and Southbridge 135. In another embodiment, a PCI bus connects theNorthbridge and the Southbridge. Southbridge 135, also known as theInput/Output (I/O) Controller Hub (ICH) is a chip that generallyimplements capabilities that operate at slower speeds than thecapabilities provided by the Northbridge. Southbridge 135 typicallyprovides various busses used to connect various components. These bussesinclude, for example, PCI and PCI Express busses, an ISA bus, a SystemManagement Bus (SMBus or SMB), and/or a Low Pin Count (LPC) bus. The LPCbus often connects low-bandwidth devices, such as boot ROM 196 and“legacy” I/O devices (using a “super I/O” chip). The “legacy” I/Odevices (198) can include, for example, serial and parallel ports,keyboard, mouse, and/or a floppy disk controller. Other components oftenincluded in Southbridge 135 include a Direct Memory Access (DMA)controller, a Programmable Interrupt Controller (PIC), and a storagedevice controller, which connects Southbridge 135 to nonvolatile storagedevice 185, such as a hard disk drive, using bus 184.

ExpressCard 155 is a slot that connects hot-pluggable devices to theinformation handling system. ExpressCard 155 supports both PCI Expressand Universal Serial Bus (USB) connectivity as it connects toSouthbridge 135 using both the USB and the PCI Express bus. Southbridge135 includes USB Controller 140 that provides USB connectivity todevices that connect to the USB. These devices include webcam (camera)150, infrared (IR) receiver 148, keyboard and trackpad 144, andBluetooth device 146, which provides for wireless personal area networks(PANs). USB Controller 140 also provides USB connectivity to othermiscellaneous USB connected devices 142, such as a mouse, removablenonvolatile storage device 145, modems, network cards, IntegratedServices Digital Network (ISDN) connectors, fax, printers, USB hubs, andmany other types of USB connected devices. While removable nonvolatilestorage device 145 is shown as a USB-connected device, removablenonvolatile storage device 145 could be connected using a differentinterface, such as a Firewire interface, etcetera.

Wireless Local Area Network (LAN) device 175 connects to Southbridge 135via the PCI or PCI Express bus 172. LAN device 175 typically implementsone of the Institute of Electrical and Electronic Engineers (IEEE)802.11 standards of over-the-air modulation techniques that all use thesame protocol to wireless communicate between information handlingsystem 100 and another computer system or device. Optical storage device190 connects to Southbridge 135 using Serial Analog Telephone Adapter(ATA) (SATA) bus 188. Serial ATA adapters and devices communicate over ahigh-speed serial link. The Serial ATA bus also connects Southbridge 135to other forms of storage devices, such as hard disk drives. Audiocircuitry 160, such as a sound card, connects to Southbridge 135 via bus158. Audio circuitry 160 also provides functionality such as audioline-in and optical digital audio in port 162, optical digital outputand headphone jack 164, internal speakers 166, and internal microphone168. Ethernet controller 170 connects to Southbridge 135 using a bus,such as the PCI or PCI Express bus. Ethernet controller 170 connectsinformation handling system 100 to a computer network, such as a LocalArea Network (LAN), the Internet, and other public and private computernetworks.

While FIG. 1 shows one information handling system, an informationhandling system may take many forms. For example, an informationhandling system may take the form of a desktop, server, portable,laptop, notebook, or other form factor computer or data processingsystem. In addition, an information handling system may take other formfactors such as a personal digital assistant (PDA), a gaming device,Automated Teller Machine (ATM), a portable telephone device, acommunication device or other devices that include a processor andmemory.

FIG. 2 provides an extension of the information handling systemenvironment shown in FIG. 1 to illustrate that the methods describedherein can be performed on a wide variety of information handlingsystems that operate in a networked environment. Types of informationhandling systems range from small handheld devices, such as handheldcomputer/mobile telephone 210 to large mainframe systems, such asmainframe computer 270. Examples of handheld computer 210 includepersonal digital assistants (PDAs), personal entertainment devices, suchas Moving Picture Experts Group Layer-3 Audio (MP3) players, portabletelevisions, and compact disc players. Other examples of informationhandling systems include pen, or tablet, computer 220, laptop, ornotebook, computer 230, workstation 240, personal computer system 250,and server 260. Other types of information handling systems that are notindividually shown in FIG. 2 are represented by information handlingsystem 280. As shown, the various information handling systems can benetworked together using computer network 200. Types of computer networkthat can be used to interconnect the various information handlingsystems include Local Area Networks (LANs), Wireless Local Area Networks(WLANs), the Internet, the Public Switched Telephone Network (PSTN),other wireless networks, and any other network topology that can be usedto interconnect the information handling systems. Many of theinformation handling systems include nonvolatile data stores, such ashard drives and/or nonvolatile memory. Some of the information handlingsystems shown in FIG. 2 depicts separate nonvolatile data stores (server260 utilizes nonvolatile data store 265, mainframe computer 270 utilizesnonvolatile data store 275, and information handling system 280 utilizesnonvolatile data store 285). The nonvolatile data store can be acomponent that is external to the various information handling systemsor can be internal to one of the information handling systems. Inaddition, removable nonvolatile storage device 145 can be shared amongtwo or more information handling systems using various techniques, suchas connecting the removable nonvolatile storage device 145 to a USB portor other connector of the information handling systems.

Today's traditional graph-based algorithms may use observable graphfeatures to evaluate similarities between two nodes by computing aseries of directly observable “features” that describe their relatedness(e.g., number of common neighbors, etc.), which requires a substantialamount of time and processing resources. Latent factor model algorithmsmay also be used to analyze knowledge graphs. Latent factor models forgraphs use machine learning to learn a set of floating point numbersthat describe each node instead of computing a set of features (featuresets) to characterize the similarity between two nodes. The latentfactor models for graphs approach then evaluates two nodes' similarityto one another and determines their closeness of their sets of numbers.While floating-point latent factors can provide tremendous value tograph analysis, operations in a space of floating point numbers (e.g.finding nearest neighbors) can be very slow.

Semantic hashing is a form of retrieving similar datapoints (and morebroadly, evaluating similarity between data points) to compare certaintypes of dense data, such as images, text, etc. In semantic hashing,each document or image is reduced to a set of features using deeplearning techniques. To avoid a nearest neighbor search, however, thesefeatures are designed to be binary-valued instead of real-valued.Semantic hashing as it is designed, however, does not work with largesparse data, such as the data contained in most large graphs of interesttoday, where a fraction of the possible edges between nodes actuallyexist.

FIGS. 3 through 6 depict an approach of creating neural bit embeddingsfor knowledge graph nodes to quickly provide information for userqueries corresponding to the knowledge graph nodes. The approachdescribed herein uses a direct end-to-end approach to learnbinary-valued features for large sparse graphs and, rather thanseparating the learning of a real embedding and the learning of itsquantization, the embeddings are explicitly optimized for their eventualquantization and use in link prediction/node retrieval. Bycharacterizing the embeddings as independent decisions of varying bias,continuous optimization techniques are applied to an approximateexpected loss. Embeddings optimized in this fashion outperform thequantization of both spectral graph embeddings and various learnedreal-valued embeddings on both ranking and pre-ranking tasks for avariety of datasets.

FIG. 3 is a high-level diagram depicting an example of a systemtransforming knowledge graph information into binary-valued embeddingvectors and using the binary-valued embedding vectors to efficientlyprovide accurate answers during a question answer session.

Information handling system 100 stores knowledge graph 305 in data store300. Knowledge graph 305 includes nodes (A, B, C, D, . . . ) and edgesconnecting the various nodes. Binary-valued embeddings generation module320 performs a series of steps to transform knowledge graph 305's nodesand edges into binary-valued embedding vectors 330. Steps includeindexing each node a value V; initializing a D-dimensional vector foreach node to form a matrix E of size V×D; initializing the matrix E withuniform random values; optimizing the matrix and generating embeddingapproximation values for each node; and transforming the embeddingapproximation values into binary-valued embedding vectors. Binary-valuedembedding vectors 330 are stored in embeddings store 350 (see FIG. 4 andcorresponding text for further details).

Information handling system 100 (e.g., a question answer system)receives query 360 that requests nodes similar to “A.” For example,query 360 may ask “Which Chinese organization is most closely related toNabisco?” or “Which nodes best complete the analogy Obama:JoeBiden::Baghdadi:______?” Node lookup module 370 locates an entry fornode A in embeddings store 350 and retrieves node A's correspondingbinary-valued embedding vector 375 (from binary-valued embedding vectors330). Next, closest neighbor vector generator 380 flips each bit ofbinary-valued embedding vector 375 individually while keeping the otherbits fixed to generate binary-valued embedding vector 375's closestneighbors, which equates to one distance away from node A in eachdirection. Closest neighbors vectors 385 shows vectors <0,0,1,0> (firstbit flipped), <1,1,1,0> (second bit flipped), <1,0,0,0> (third bitflipped), and <1,0,1,1> (fourth bit flipped) (see FIG. 6 andcorresponding text for further details).

Comparator 390 searches through embeddings store 350 to locate entriesthat include binary-valued embedding vectors that match one of closestneighbors vectors 385. Comparator 390 then identifies the nodecorresponding to the matching vector and provides results 395accordingly. As can be seen from binary-valued embedding vectors 330produced by binary-valued embeddings generation module 320, node “C” hasa binary-valued embedding vector of <1,1,1,0>, which matches one ofclosest neighbors vectors 385 (see FIG. 6 and corresponding text forfurther details).

FIG. 4 is a flowchart depicting an example of steps taken to generatebinary value embedding vectors for nodes in a knowledge graph. FIG. 4processing commences at 400 whereupon, at step 410, the processretrieves knowledge graph information (e.g., knowledge graph 305) andassigns an index to each node in the knowledge graph between 1 and N,where N is the number of nodes in the graph.

At step 420, the process initializes embedding elements inD-dimensionality (number of feature sets) between 0 and 1 for each nodein a matrix E, resulting in a matrix of size N×D. For example, ifknowledge graph 305 includes 500 nodes and 30 dimensions, the processinitiates 30 embedding elements into each node to produce a matrix ofsize 500×30. At step 430, the process initializes the matrix E withuniform random values between 0 and 1.

At step 440, the process optimizes the matrix E to minimize an objectfunction and generates embedding approximation values for each node(Eij). For example, the process may use an objective function such as:

${{L_{mean}(G)} = {{\sum\limits_{{({i,j})} \in G}{{- \log}\frac{e^{{{ad}_{H}{({p_{i},p_{j}})}} + b}}{e^{{{ad}_{H}{({p_{i},p_{j}})}} + b} + {p_{K}\left( j \middle| i \right)}}}} - {\log \frac{p_{K}\left( K_{ij} \middle| i \right)}{e^{{{ad}_{H}{({p_{i},p_{K}})}} + b} + {p_{K}\left( K_{ij} \middle| i \right)}}}}},$

In the above formula, p_i and p_j refer to the embedding feature vectorsfor nodes i and j. The function d_H refers to a continuous Hammingdistance between two vectors (d_h(x,y)=\sum_i x_i*(1−y_i)+(1−x_i)*y_i).P_K(j|i) is a constant 1/number_of_nodes_in_graph, and a and b arelearned parameters. To arrive at the above objective, the processassumes that the entries of E will be turned into a matrix B of binary0-1 numbers in the following random manner: B_ij is set to 1 withprobability E_ij, and is set to 0 with probability 1−E_ij. To learn whatthe “optimal” choice of E is, the process trains a model that predictsthe probability of an edge between any two nodes i and j given theHamming distance between their binary embedding vectors B_i and B_j:d_H(B_i, B_j). The process applies a softmax classifier to this task,leading to a log loss objective with B_i and B_j in place of p_i andp_j. As this objective is a function of the randomly generated matrix B,the process replaces it with its mean over all the different matrices Bthat could be drawn according to the procedure outlined above. A simpleand accurate (for large enough dimensionality D) approximation to thisis to recognize that the quantities d_H(B_i,B_j) are very concentrated,and as such may be replaced by their mean values d_H(p_i, p_j), leadingdirectly to the objective above.

For cases where the dimensionality D is smaller, the above approximationmay be insufficiently accurate. In these cases, instead of approximatingd_H(B_i,B_j) by its mean value d_H(p_i,p_j), the process performsapproximation by a Gaussian distribution with mean mu_ij and variancesigma_ij, where mu_ij=d_H(p_i,p_j), andsigma_ij=sum_{k=1}̂{K=D}(p_ik*(1−p_jk)+(1−p_ik)*p_jk). The approximateobjective can then be defined via numerical integration as:

${E\left\lbrack {f\left( {\mu_{ij} + {\sigma_{ij}Z}} \right)} \right\rbrack}_{Z} = {{\int_{0}^{1}{{f\left( {\mu_{ij} + {\sigma_{ij}z}} \right)}d\; \Phi_{z}}} \approx \ {\frac{1}{2N}{\sum\limits_{n = 1}^{N}{{f\left( {\mu_{ij} + {\sigma_{ij}{\Phi_{z}^{- 1}\left( \frac{{2n} - 1}{2N} \right)}}} \right)}.}}}}$

where

${f(x)} = {{\log\left( \frac{e^{{ax} + b}}{e^{{ax} + b} + C} \right)} + {\log \left( \frac{C}{e^{{ax} + b} + C} \right)}}$

with C=1/number_nodes and with Phi_z denoting the Gaussian cumulativedistribution function.

At step 450, the process transforms the embedding approximation valuesEij into binary value embedding elements/vectors (Bij) by changing Bij=1when Eij>0.5, and changing Bij=0 when Eij<=0.5. At step 480, the processstores the binary value embedding vectors of each node in embeddingsstore 350. FIG. 4 processing thereafter ends at 495.

FIG. 5 is a diagram depicting an example of a knowledge graph andbinary-valued embedding vectors generated through steps shown in FIG. 4.

Knowledge graph 305 may include hundreds or thousands of nodes, eachrepresenting an entity. As those skilled in the art can appreciate, thenodes are positioned based on their feature sets relative to the othernodes. For example, nodes corresponding to a specific subject(automobiles, politics, etc.) may be in close spatial proximity to eachother.

Binary-valued embeddings generation module 320 creates binary-valuedembedding vectors 330 for each node within knowledge graph 305 using thesteps discussed above. In turn, information handling system 100 can usebinary-valued embedding vectors 330 to quickly provide answers toqueries in real-time without taxing processing resources to performcomplex algorithms (see FIG. 6 and corresponding text for furtherdetails). As those skilled in the art can appreciate, binary-valuedembedding vectors 330 may be stored in a matrix, in a database, backinto knowledge graph 305, or any other means to access during queryprocessing.

FIG. 6 is a flowchart depicting an example of steps taken to receive aquery and efficiently provide accurate results using pre-generatedbinary-valued embedding vectors. FIG. 6 processing commences at 600whereupon, at step 610, the process receives a query with acorresponding element, such as query 360's similarity to “A” shown inFIG. 3. At step 620, the process identifies nodes in embeddings store350 that correspond to the query element using techniques such asmapping the element to the knowledge graph and using brute force Hammingdistance computations between the query embedding and the nodeembeddings to find the nearest neighbors, direct lookup of nearby nodesto the query if the embedding vectors are used as memory addresses (asin semantic hashing), etc.

At step 630, the process identifies binary-valued embedding vectors ofthe matching nodes. Referring to FIG. 3, node lookup module 370identifies binary value embedding vector 375 to correspond with element“A” from query 360.

Next, at step 640, the process generates closest neighbor vectors basedon the matching entities' binary value embeddings vectors by flippingeach bit, on an individual basis, of the identified binary-valuedembedding vectors. Referring to FIG. 3, closest neighbor vectorgenerator 380 generates vectors 385 from vector 375 by changing one bitat a time for each of the four different elements in binary-valuedembedding vector 375.

At step 650, the process compares the closest neighbor vectors againstthe corpus of binary-valued embedding vectors stored in embeddings store350 and identifies those binary-valued embedding vectors that match thegenerated closest neighbor vectors. At step 660, the process identifiesthe nodes corresponding to the matched binary-valued embedding vectorsand provides the node results accordingly. Referring to FIG. 3,comparator 390 determines that node “C” has a binary-valued embeddingvector that matches one of vectors 385, which is “<1,1,1,0>” frombinary-valued embedding vectors 330. FIG. 6 processing thereafter endsat 695.

While particular embodiments of the present disclosure have been shownand described, it will be obvious to those skilled in the art that,based upon the teachings herein, that changes and modifications may bemade without departing from this disclosure and its broader aspects.Therefore, the appended claims are to encompass within their scope allsuch changes and modifications as are within the true spirit and scopeof this disclosure. Furthermore, it is to be understood that thedisclosure is solely defined by the appended claims. It will beunderstood by those with skill in the art that if a specific number ofan introduced claim element is intended, such intent will be explicitlyrecited in the claim, and in the absence of such recitation no suchlimitation is present. For non-limiting example, as an aid tounderstanding, the following appended claims contain usage of theintroductory phrases “at least one” and “one or more” to introduce claimelements. However, the use of such phrases should not be construed toimply that the introduction of a claim element by the indefinitearticles “a” or “an” limits any particular claim containing suchintroduced claim element to disclosures containing only one suchelement, even when the same claim includes the introductory phrases “oneor more” or “at least one” and indefinite articles such as “a” or “an”;the same holds true for the use in the claims of definite articles.

1. (canceled)
 2. (canceled)
 3. (canceled)
 4. (canceled)
 5. (canceled) 6.(canceled)
 7. (canceled)
 8. An information handling system comprising:one or more processors; a memory coupled to at least one of theprocessors; a set of computer program instructions stored in the memoryand executed by at least one of the processors in order to performactions of: transforming a plurality of embedding approximation valuesinto a plurality of binary valued embedding vectors, wherein theplurality of embedding approximation values correspond to a plurality ofnodes in a knowledge graph; evaluating the plurality of binary valuedembedding vectors against a query, wherein the evaluating results in aselection of one of the plurality of binary valued embedding vectors;identifying one of the plurality of nodes that corresponds to theselected binary valued embedding vector; and providing a result to thequery based on the identified node.
 9. The information handling systemof claim 8 wherein the one or more processors perform additional actionscomprising: initializing a plurality of embedding elements having anumber of dimensions, wherein the number of dimensions is based on anamount of feature sets corresponding to each of the plurality of nodes;generating a matrix based on an amount of the plurality of nodes and thenumber of dimensions; and optimizing the matrix to minimize an objectivefunction, wherein the optimization produces the plurality of embeddingapproximation values.
 10. The information handling system of claim 8wherein the one or more processors perform additional actionscomprising: assigning a binary value of 0 to each of the plurality ofembedding approximation values that is less than 0.5; and assigning abinary value of 1 to each of the plurality of embedding approximationvalues that is greater than or equal to 0.5.
 11. The informationhandling system of claim 8 wherein the plurality of nodes are sparselydistributed in the knowledge graph.
 12. The information handling systemof claim 8 wherein the one or more processors perform additional actionscomprising: determining that one of the plurality of nodes matches thequery; identifying one of the plurality of binary valued embeddingvectors that corresponds to the matched node; and creating a pluralityof closest neighbor vectors from the identified binary valued embeddingvector.
 13. The information handling system of claim 12 wherein the oneor more processors perform additional actions comprising: matching theplurality of closest neighbor vectors to the plurality of binary valuedembedding vectors, wherein the matching produces the selection of one ofthe plurality of binary valued embedding vectors.
 14. The informationhandling system of claim 12 wherein the one or more processors performadditional actions comprising: mapping an element in the query into theknowledge graph; and identifying a closest neighbor to the mappedelement, wherein the closest neighbor is the matched node.
 15. Acomputer program product stored in a computer readable storage medium,comprising computer program code that, when executed by an informationhandling system, causes the information handling system to performactions comprising: transforming a plurality of embedding approximationvalues into a plurality of binary valued embedding vectors, wherein theplurality of embedding approximation values correspond to a plurality ofnodes in a knowledge graph; evaluating the plurality of binary valuedembedding vectors against a query, wherein the evaluating results in aselection of one of the plurality of binary valued embedding vectors;identifying one of the plurality of nodes that corresponds to theselected binary valued embedding vector; and providing a result to thequery based on the identified node.
 16. The computer program product ofclaim 15 wherein the information handling system performs furtheractions comprising: initializing a plurality of embedding elementshaving a number of dimensions, wherein the number of dimensions is basedon an amount of feature sets corresponding to each of the plurality ofnodes; generating a matrix based on an amount of the plurality of nodesand the number of dimensions; and optimizing the matrix to minimize anobjective function, wherein the optimization produces the plurality ofembedding approximation values.
 17. The computer program product ofclaim 15 wherein the information handling system performs furtheractions comprising: assigning a binary value of 0 to each of theplurality of embedding approximation values that is less than 0.5; andassigning a binary value of 1 to each of the plurality of embeddingapproximation values that is greater than or equal to 0.5.
 18. Thecomputer program product of claim 15 wherein the plurality of nodes aresparsely distributed in the knowledge graph.
 19. The computer programproduct of claim 15 wherein the information handling system performsfurther actions comprising: determining that one of the plurality ofnodes matches the query; identifying one of the plurality of binaryvalued embedding vectors that corresponds to the matched node; andcreating a plurality of closest neighbor vectors from the identifiedbinary valued embedding vector.
 20. The computer program product ofclaim 19 wherein the information handling system performs furtheractions comprising: matching the plurality of closest neighbor vectorsto the plurality of binary valued embedding vectors, wherein thematching produces the selection of one of the plurality of binary valuedembedding vectors.